Conditions for stability and instability of retrial queueing systems with general retrial times
نویسنده
چکیده
We study the stability of single server retrial queues under general distribution for retrial times and stationary ergodic service times, for three main retrial policies studied in the literature: classical linear, constant and control policies. The approach used is the renovating events approach to obtain sufficient stability conditions by strong coupling convergence of the process modeling the dynamics of the system to a unique stationary ergodic regime. We also obtain instability conditions by convergence in distribution to improper limiting sequences.
منابع مشابه
Sufficient stability conditions for multi-class constant retrial rate systems
We study multi-class retrial queueing systems with Poisson inputs, general service times, and an arbitrary numbers of servers and waiting places. A class-i blocked customer joins orbit i and waits in the orbit for retrial. Orbit i works like a single-server ·/M/1 queueing system with exponential retrial time regardless of the orbit size. Such retrial systems are referred to as retrial systems w...
متن کاملAnalysis of the Number of Orbiting Customers in M/g/1 Retrial Queue with General Retrial Times
The research in the area of retrial queues focused mainly on the fact that the retrials operate under classical retrial policy, which suppose that the intervals between successive repeated attempts are exponentially distributed with total rate jθ (j is the number of customers in the orbit). There is another discipline, called constant retrial policy, where the total retrial rate does not depend...
متن کاملErgodicity of the BMAP/PH}/s/s+K retrial queue with PH-retrial times
Abstract Define the traffic intensity as the ratio of the arrival rate to the service rate. This paper shows that the BMAP/PH/s/s+K retrial queue with PH-retrial times is ergodic if and only if its traffic intensity is less than one. The result implies that the BMAP/PH/s/s+K retrial queue with PH-retrial times and the corresponding BMAP/PH/s queue have the same condition for ergodicity, a fact ...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملAveraging Met hods for Transient Regimes in Overloading Retrial Queueing Systems
A new approach is suggested to study transient and stable regimes in overloading retrial queueing systems. This approach is based on limit theorems of averaging principle and diffusion approximation types for so-called switching processes. Two models of retrial queueing systems of the types h?/G/i/w.r (multidimensional Poisson input flow, one server with general service times, retrial system) a...
متن کامل